Is It Reasonable to Employ Agents in Automated Theorem Proving?
نویسندگان
چکیده
Agent architectures and parallelization are, with a few exceptions, rarely to encounter in traditional automated theorem proving systems. This situation is motivating our ongoing work in the higher-order theorem prover Leo-III . In contrast to its predecessor – the well established prover LEO-II – and most other modern provers, Leo-III is designed from the very beginning for concurrent proof search. The prover features a multiagent blackboard architecture for reasoning agents to cooperate and to parallelize proof construction on the term, clause and search level.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملAgent-Oriented Integration of Distributed Mathematical Services
Real-world applications of automated theorem proving require modern software environments that enable modularisation, networked inter-operability, robustness, and scalability. These requirements are met by the Agent-Oriented Programming paradigm of Distributed Arti cial Intelligence. We argue that a reasonable framework for automated theorem proving in the large regards typical mathematical ser...
متن کاملA PPLICATIONS 4 . 2 Cooperative Parallel Automated Theorem Proving
Up to now, the sequential Automated Theorem Proving (ATP) has set a very powerful standard. But when dealing with more difficult problems ATP systems are still inferior to a skilled human mathematician. Thus, methods to increase the performance of existing ATP systems are, besides the development of new proof calculi, a focus of interest in the ATP area. One important technique to increase perf...
متن کاملRewriting and Well-Definedness within a Proof System
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving between deduction and computation (i.e., rewriting) steps. If the logic of reasoning supports partial functions, it is necessary that rewriting copes with pot...
متن کاملDistributed agent-based automated theorem proving in order-sorted first-order logic
This paper presents a distributed agent-based automated theorem proving framework based on ordersorted first-order logic. Each agent in our framework has its own knowledge base, communicating to its neighboring agent(s) using message-passing algorithms. The communication language between agents is restricted in such a manner that each agent can only communicate to its neighboring agent(s) by me...
متن کامل